Stretch at 10: A Progress Report on Arizona State University's Stretch Program
نویسندگان
چکیده
منابع مشابه
On Stretch curvature of Finsler manifolds
In this paper, Finsler metrics with relatively non-negative (resp. non-positive), isotropic and constant stretch curvature are studied. In particular, it is showed that every compact Finsler manifold with relatively non-positive (resp. non-negative) stretch curvature is a Landsberg metric. Also, it is proved that every (α,β)-metric of non-zero constant flag curvature and non-zero relatively i...
متن کاملApplication Stretch Physical Memory ISD Broker Stretch
Recent developments in the area of memory management have focused on reducing the eeects of the disk latency problem. These developments include the use of a compressed cache and the utilisation of memory on remote hosts. Further developments in the areas of Quality of Service (QoS) provision and user-level virtual memory have provided the impetus for a more spe-cialised run-time environment th...
متن کاملOn Stolt stretch time migration
We implement Stolt-stretch time migration with an analytical formulation for the optimal stretch parameter and show how it improves the quality of imaging. By a cascaded f-k migration approach with this algorithm, we manage to obtain time migration results on real data comparable to Gazdag’s phase-shift method, with a high accuracy for steeply deeping events at a computational cost dramatically...
متن کاملProgress Report on Apollo Program
It is a great pleasure to be here today and to greet you hardy suMvors of the pool party. I will do my best to avoid loud noises and bright colors during my status report. Since the last SETP Symposium, the Apollo Program has been quite busy in a number of different areas. (Figure 1) My problem is to sift through this information and to talk only about those things of most interest to you. Firs...
متن کاملStretching Stretch
We give a generalized definition of stretch that simplifies the efficient construction of lowstretch embeddings suitable for graph algorithms. The generalization, based on discounting highly stretched edges by taking their pth power for some 0 < p < 1, is directly related to performances of existing algorithms. This discounting of high-stretch edges allows us to treat many classes of edges with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Basic Writing
سال: 2007
ISSN: 0147-1635
DOI: 10.37514/jbw-j.2007.26.2.03